package hpp.problems;

/**
 * 找出数组A在数组B中不存在的元素
 * Created by hpp on 2017/7/20.
 */
public class Problem1 {

    public static void main(String[] args) {
        String[] arr = {"a","a","b","e","d","n", "o","p","q","r","s","t",
                "u","b","w","x","y","z"};
        String[] characters = {
                "a","b","c","d","e","f","g",
                "h","i","j","k","l","m","n",
                "o","p","q","r","s","t",
                "u","b","w","x","y","z"
        };

        for(int i = 0;i<characters.length;i++){
            int j = 0;
            for(;j<arr.length;j++){
                if(characters[i].equals(arr[j]))
                    break;
            }
            if(j==arr.length){
                System.out.println("arr不存在的元素:" + characters[i]);
            }
        }

    }


}
